Solving the Longest Simple Path Problem with Constraint-Based Techniques
نویسندگان
چکیده
The longest simple path problem on graphs arises in a variety of context, e.g., information retrieval, VLSI design, robot patrolling. Given an undirected weighted graph G = (V,E) , the problem consists of finding the longest simple path (i.e., no vertex occurs more than once) onG . We propose in this paper an exact and a tabu search algorithm for solving this problem. We show that our techniques give competitive results on di erent kinds of graphs, compared with recent genetic algorithms.
منابع مشابه
Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملCockpit Crew Pairing Problem in Airline Scheduling: Shortest Path with Resources Constraints Approach
Increasing competition in the air transport market has intensified active airlines’ efforts to keep their market share by attaching due importance to cost management aimed at reduced final prices. Crew costs are second only to fuel costs on the cost list of airline companies. So, this paper attempts to investigate the cockpit crew pairing problem. The set partitioning problem has been used for ...
متن کاملSolving Path Following Problem for Car-Like Robot in the Presence of Sliding Effect via LMI Formulation
One of the main problems of car-like robot is robust path following in the presence of sliding effect. To tackle this problem, a robust mix H2/H∞ static state feedback control method is selected. This method is the well-known linear robust controller which is robust against external disturbance as well as model uncertainty. In this paper, the path following problem is formulated as linear matri...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کامل